Questions
3 of 19
1What is the Prefix Sum technique?
2Why is insertion/deletion in the middle of an array O(n)?
3Explain the concept of Amortized O(1) for Dynamic Array insertion.
4How do you find the second largest element in an unsorted array?
5What is the difference between a String and a Character Array?
6What is the Sliding Window technique? Give a use case.
7What is a Sparse Array? When is it useful?
8Why is string concatenation in a loop O(n²)? How do you fix it? (StringBuilder)
9What is the Two-Pointer technique? Give a use case.
10What is a Dynamic Array (ArrayList/Vector)? How does it grow?
11What are the advantages and disadvantages of Arrays?
12What is an Array? How is it stored in memory?
13Explain Kadane's Algorithm (Maximum Subarray Sum). What is its complexity?
14Why are Strings immutable in Java/C#? What are the benefits?
15What is String Interning?
16Explain how to find the longest palindromic substring.
17Why is accessing an array element O(1)?
18How do you check if two strings are anagrams of each other?
19How do you rotate an array by k positions? (In-place vs extra space)
Data-StructuresData-Structures
Basics
Complexity Analysis
Arrays and Strings
Linked Lists
Stacks and Queues
Hash Tables
03 / 19

Explain the concept of Amortized O(1) for Dynamic Array insertion.

Amortized Analysis

javascript
  1. 1

    An individual resize can be O(n).

  2. 2

    Resizing happens only occasionally when capacity is exhausted.

  3. 3

    Geometric growth prevents resizing on every insertion.

  4. 4

    Across n insertions, total copying work is O(n).

  5. 5

    Therefore, append is amortized O(1), although its worst-case individual operation can be O(n).

Difficulty: 3/10

Follow-up Questions

  • ❓What is the difference between amortized and average-case complexity?
  • ❓Why is geometric growth important?